Sparse Matrix-Vector Multiplication for Circuit Simulation
نویسنده
چکیده
Sparse Matrix-Vector Multiplication (SpMV) plays an important role in numerical algorithm in circuit simulation. In this report, we utilize Message Passing Interface (MPI) to parallelize the SpMV. In addition, resulting from the circuit simulation matrix formulation, the circuit systems are often represented as unstructured, not evenly-distributed sparse matrices. Therefore, we automatically detect rows’ number of non-zero elements and balance the computing workload to distribute tasks among different processes. We observed large speedups to compare with serial SpMV and our first evenly-row partition MPI-SpMV(Algorithm 1).We also design MPI_Reduce method, however, we still use point-to-point method due to the performance based our implementation.
منابع مشابه
Sparse Matrix Multiplication on CAM Based Accelerator
Sparse matrix multiplication is an important component of linear algebra computations. In this paper, an architecture based on Content Addressable Memory (CAM) and Resistive Content Addressable Memory (ReCAM) is proposed for accelerating sparse matrix by sparse vector and matrix multiplication in CSR format. Using functional simulation, we show that the proposed ReCAM-based accelerator exhibits...
متن کاملCache-Oblivious Sparse Matrix--Vector Multiplication by Using Sparse Matrix Partitioning Methods
In this article, we introduce a cache-oblivious method for sparse matrix vector multiplication. Our method attempts to permute the rows and columns of the input matrix using a hypergraph-based sparse matrix partitioning scheme so that the resulting matrix induces cache-friendly behaviour during sparse matrix vector multiplication. Matrices are assumed to be stored in row-major format, by means ...
متن کاملSparse Matrix-vector Multiplication on Nvidia Gpu
In this paper, we present our work on developing a new matrix format and a new sparse matrix-vector multiplication algorithm. The matrix format is HEC, which is a hybrid format. This matrix format is efficient for sparse matrix-vector multiplication and is friendly to preconditioner. Numerical experiments show that our sparse matrix-vector multiplication algorithm is efficient on
متن کاملRun - Time Optimization of Sparse Matrix - Vector Multiplication onSIMD
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientiic computations (e.g., nite element methods). In such solvers, the matrix-vector product is computed repeatedly, often thousands of times, with updated values of the vector until convergence is achieved. In an SIMD architecture, each processor has to fetch the updated oo-processor vector elemen...
متن کاملFinite Projective Geometry based Fast, Conflict-free Parallel Matrix Computations
Matrix computations, especially iterative PDE solving (and the sparse matrix vector multiplication subproblem within) using conjugate gradient algorithm, and LU/Cholesky decomposition for solving system of linear equations, form the kernel of many applications, such as circuit simulators, computational fluid dynamics or structural analysis etc. The problem of designing approaches for paralleliz...
متن کامل